Binary Search Trees: Average and Worst Case Behavior
نویسندگان
چکیده
We discuss several simple strategies for constructing binary search trees. Upper and lower bounds for the average and worst case search time in trees constructed according to these strategies are derived. Furthermore, different implementations are discussed and the results are applied to digital searching.
منابع مشابه
Complexity of Layered Binary Search Trees with Relaxed Balance
When search trees are made relaxed, balance constraints are weakened such that updates can be made without immediate rebalancing. This can lead to a speed-up in some circumstances. However, the weakened balance constraints also make it more challenging to prove complexity results for relaxed structures. In our opinion, one of the simplest and most intuitive presentations of balanced search tree...
متن کاملBinmaps: Hybridizing Bitmaps and Binary Trees
This report addresses the classical problem of keeping huge bitmaps predominantly consisting of long ranges of zeros and ones. The problem is most often encountered in filesystems (free space tracking) and network protocols (transmission progress tracking). Three classical solutions to the problem are plain bitmaps (NTFS), extent lists (TCP SACK) and extent binary trees (XFS, Btrfs). Bitmaps ar...
متن کاملSmoothed Analysis of the Height of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform distribution is only logarithmic. The exact value is one of the best studied problems in average case complexity. We investigate what happens in between by analysing the smoothed height of binary search trees: random...
متن کاملSmoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform distribution is only logarithmic. The exact value is one of the best studied problems in average-case complexity. We investigate what happens in between by analysing the smoothed height of binary search trees: Random...
متن کاملAn O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
We present the zipper tree, the first O(log logn)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search trees, optimal worst-case access time and near-optimal amortized access time can be guaranteed simultaneously.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Elektronische Informationsverarbeitung und Kybernetik
دوره 16 شماره
صفحات -
تاریخ انتشار 1976